Several Classes of Stationary Points for Rank Regularized Minimization Problems
نویسندگان
چکیده
منابع مشابه
Stationary Points of Bound Constrained Minimization Reformulations of Complementarity Problems
We consider two merit functions which can be used for solving the nonlinear complementarity problem via nonnegatively constrained minimization. One of the functions is the restricted implicit Lagrangian (Refs. 1-3), and the other appears to be new. We study the conditions under which a stationary point of the minimization problem is guaranteed to be a solution of the underlying complementarity ...
متن کاملDistributed Majorization-Minimization for Laplacian Regularized Problems
We consider the problem of minimizing a block separable convex function (possibly nondifferentiable, and including constraints) plus Laplacian regularization, a problem that arises in applications including model fitting, regularizing stratified models, and multi-period portfolio optimization. We develop a distributed majorizationminimization method for this general problem, and derive a comple...
متن کاملIn-network Sparsity-regularized Rank Minimization: Algorithms and Applications
Given a limited number of entries from the superposition of a low-rank matrix plus the product of a known fat compression matrix times a sparse matrix, recovery of the low-rank and sparse components is a fundamental task subsuming compressed sensing, matrix completion, and principal components pursuit. This paper develops algorithms for distributed sparsity-regularized rank minimization over ne...
متن کاملRegularized Newton Methods for Convex Minimization Problems with Singular Solutions
This paper studies convergence properties of regularized Newton methods for minimizing a convex function whose Hessian matrix may be singular everywhere. We show that if the objective function is LC2, then the methods possess local quadratic convergence under a local error bound condition without the requirement of isolated nonsingular solutions. By using a backtracking line search, we globaliz...
متن کاملA regularized limited-memory BFGS method for unconstrained minimization problems
The limited-memory BFGS (L-BFGS) algorithm is a popular method of solving large-scale unconstrained minimization problems. Since LBFGS conducts a line search with the Wolfe condition, it may require many function evaluations for ill-posed problems. To overcome this difficulty, we propose a method that combines L-BFGS with the regularized Newton method. The computational cost for a single iterat...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Optimization
سال: 2020
ISSN: 1052-6234,1095-7189
DOI: 10.1137/19m1270987